Estimating failure time distribution and its parameters based on intermediate data from a Wiener degradation model

Instead of measuring a Wiener degradation or performance process at predetermined time points to track degradation or performance of a product for estimating its lifetime, we propose to obtain the first‐passage times of the process over certain nonfailure thresholds. Based on only these intermediate data, we obtain the uniformly minimum variance unbiased estimator and uniformly most accurate confidence interval for the mean lifetime. For estimating the lifetime distribution function, we propose a modified maximum likelihood estimator and a new estimator and prove that, by increasing the sample size of the intermediate data, these estimators and the above‐mentioned estimator of the mean lifetime can achieve the same levels of accuracy as the estimators assuming one has failure times. Thus, our method of using only intermediate data is useful for highly reliable products when their failure times are difficult to obtain. Furthermore, we show that the proposed new estimator of the lifetime distribution function is more accurate than the standard and modified maximum likelihood estimators. We also obtain approximate confidence intervals for the lifetime distribution function and its percentiles. Finally, we use light‐emitting diodes as an example to illustrate our method and demonstrate how to validate the Wiener assumption during the testing. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Nonrobustness of the normal approximation of lead‐time demand in a (Q,R) system

For computing an optimal (Q, R) or kindred inventory policy, the current literature provides mixed signals on whether or when it is safe to approximate a nonnormal lead‐time‐demand (“LTD”) distribution by a normal distribution. The first part of this paper examines this literature critically to justify why the issue warrants further investigations, while the second part presents reliable evidence showing that the system‐cost penalty for using the normal approximation can be quite serious even when the LTD‐distribution's coefficient of variation is quite low—contrary to the prevalent view of the literature. We also identify situations that will most likely lead to large system‐cost penalty. Our results indicate that, given today's technology, it is worthwhile to estimate an LTD‐distribution's shape more accurately and to compute optimal inventory policies using statistical distributions that more accurately reflect the LTD‐distributions' actual shapes. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

PTFE润滑剂的研制

介绍了PTFE润滑剂的研制过程、配方、制备工艺和应用效果。结果表明以PAO合成油和矿物油的混合油为基础油,以PTFE超细粉为润滑组分,通过加入多种添加剂研制的PTFE润滑剂具有胶体稳定性、分散性、润滑性和防护性。     

Machine scheduling with pickup and delivery

The coordination of production, supply, and distribution is an important issue in logistics and operations management. This paper develops and analyzes a single‐machine scheduling model that incorporates the scheduling of jobs and the pickup and delivery arrangements of the materials and finished jobs. In this model, there is a capacitated pickup and delivery vehicle that travels between the machine and the storage area, and the objective is to minimize the makespan of the schedule. The problem is strongly NP‐hard in general but is solvable in polynomial time when the job processing sequence is predetermined. An efficient heuristic is developed for the general problem. The effectiveness of the heuristic is studied both analytically and computationally. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Attrition through a partially coordinated area defense

An area defense consists of several groups that act independently, i.e., do not communicate with each other. Each group has a fixed number of defenders and a controller that allocates these defenders optimally against the individual attackers comprising an attack. We analyze the effectiveness of this partially coordinated defense against a simultaneous attack of known size in which all attackers are considered to be equally lethal. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Finding the Kth shortest path in a time‐schedule network

We consider the problem of finding the Kth shortest path for a time‐schedule network, where each node in the network has a list of prespecified departure times, and departure from the node can take place only at one of these departure times. We develop a polynomial time algorithm independent of K for finding the Kth shortest path. The proposed algorithm constructs a map structure at each node in the network, using which we can directly find the Kth shortest path without having to enumerate the first K − 1 paths. Since the same map structure is used for different K values, it is not necessary to reconstruct the table for additional paths. Consequently, the algorithm is suitable for directly finding multiple shortest paths in the same network. Furthermore, the algorithm is modified slightly for enumerating the first K shortest paths and is shown to have the lowest possible time complexity under a condition that holds for most practical networks. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost

We consider a make‐to‐order production–distribution system with one supplier and one or more customers. A set of orders with due dates needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that optimizes an objective function involving the maximum delivery tardiness and the total distribution cost. We first study the solvability of various cases of the problem by either providing an efficient algorithm or proving the intractability of the problem. We then develop a fast heuristic for the general problem. We show that the heuristic is asymptotically optimal as the number of orders goes to infinity. We also evaluate the performance of the heuristic computationally by using lower bounds obtained by a column generation approach. Our results indicate that the heuristic is capable of generating near optimal solutions quickly. Finally, we study the value of production–distribution integration by comparing our integrated approach with two sequential approaches where scheduling decisions for order processing are made first, followed by order delivery decisions, with no or only partial integration of the two decisions. We show that in many cases, the integrated approach performs significantly better than the sequential approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

基于DWK海洋作战建模与仿真

直接基于HLA/RTI进行分布式仿真系统开发,存在对用户开发经验要求较高的问题,针对这种不足,提出了一种基于DWK(数字化武器开发平台)快速构建海洋作战仿真系统的方法.在简述DWK功能结构的基础上,解决了系统结构设计、实体建模、FOM开发、兵力模型和HLA模型研究、联邦成员开发等多项关键技术,系统的开发过程证明了该方法...     

基于机动识别的多级组合滤波器设计

针对机动目标滤波问题,利用基础的琢-茁滤波算法,建立了基于机动识别的多级组合琢-茁滤波算法.从工程可实现角度出发,重点阐述了组合滤波器的机动识别算法、野值剔除算法、机动识别与野值剔除启动算法,以及多级滤波器的切换规则.仿真结果验证了组合滤波算法的有效性.     

叶片数对无轴泵喷推进器性能的影响

为丰富无轴泵喷推进器噪声性能优化理论,研究了叶片数对无轴泵喷推进器性能的影响,重点探究了不同叶片数下无轴泵喷推进器内的压力脉动变化规律。基于计算流体力学中的有限体积法离散RANS方程,应用RNG k-ε湍流模型封闭计算模型,采用SIMPLEC进行压力-速度耦合,对不同叶片数下的无轴泵喷推进器内部流场进行了非定常数值模拟计算,并对计算结果进行了详细的对比分析。研究结果表明：随叶片数的增加,无轴泵喷推进器模型的扬程、效率和推力均逐渐增大,叶片表面压力分布更加均匀,叶轮轮缘和中部的压力脉动均明显降低,叶轮进出口主频处的压力脉动幅值从轮缘向中心逐渐减小。